Bitwise Regularity and Ga-hardness

| We present in this paper a theoretical analysis that relates an irregularity measure of a tness function to the so-called GA-deception. This approach is a continuation of a work 18] that has presented a deception analysis of HH older functions. The analysis developed here is a generalization of this work in two ways : we rst use a \bitwise regularity" instead of a HH older exponent as a basis for our deception analysis, second, we perform a similar deception analysis of a GA with uniform crossover. We nally propose to use the bitwise regularity coeecients in order to analyze the innuence of a chromosome encoding on the GA eeciency, and we present experiments with Gray encoding.